Search results

To create new hybrid algorithms that combine boosting and support vector machines to outperform other known algorithms in selected contexts of binary classification problems.

Support vector machines (SVM) are known in the literature to be one of the most efficient learning models for tackling classification problems. Boosting algorithms rely on other classification algorithms to produce different weak hypotheses which are later combined into a single strong hypothesis. In this work the authors combine boosting with support vector machines, namely the AdaBoost.M1 and sequential minimal optimization (SMO) algorithms, to create new hybrid algorithms that outperform standard SVMs in selected contexts. This is achieved by integration with different degrees of coupling, where the four algorithms proposed range from simple black‐box integration to modifications and mergers between AdaBoost.M1 and SMO components.

The results show that the proposed algorithms exhibited better performance for most problems experimented. It is possible to identify trends of behavior bound to specific properties of the problems solved, where one may hence apply the proposed algorithms in situations where it is known to succeed.

New strategies for combining boosting and SVMs may be further developed using the principles introduced in this paper, possibly resulting in other algorithms with yet superior performance.

The hybrid algorithms proposed in this paper may be used in classification problems with properties that they are known to handle well, thus possibly offering better results than other known algorithms in the literature.

This paper introduces the concept of merging boosting and SVM training algorithms to obtain hybrid solutions with better performance than standard SVMs.